On the Existence of Extractable One-Way Functions
نویسندگان
چکیده
منابع مشابه
On the Existence of Extractable One-Way Functions
Extractability is one of the main and central tools for design and analysis of modern cryptographic protocols. We say a function is extractable if any adversary that outputs a point in the range of the function is guaranteed to ”know” a corresponding preimage. This research presents a short report on the existence of extractable one-way functions based on a recent paper by Bitansky et al. [BCPR...
متن کاملExtractable Perfectly One-Way Functions
We propose a new cryptographic primitive, called extractable perfectly one-way (EPOW) functions. Like perfectly one-way (POW) functions, EPOW functions are probabilistic functions that reveal no information about their input, other than the ability to verify guesses. In addition, an EPOW function, f , guarantees that any party that manages to compute a value in the range of f “knows” a correspo...
متن کاملOn the Existence of Weak One-Way Functions
This note is an attempt to unconditionally prove the existence of weak one-way function (OWF). Starting from a provably intractable decision problem LD (whose existence is nonconstructively assured from the wellknown discrete time-hierarchy theorem from complexity theory), we construct another intractable decision problem L ⊆ {0, 1} that has its words scattered across {0, 1} at a relative frequ...
متن کاملHow To Construct Extractable One-Way Functions Against Uniform Adversaries
A function f is extractable if it is possible to algorithmically “extract,” from any program that outputs a value y in the image of f, a preimage of y. When combined with hardness properties such as one-wayness or collision-resistance, extractability has proven to be a powerful tool. However, so far, extractability has not been explicitly shown. Instead, it has only been considered as a nonstan...
متن کاملOn complete one-way functions
Complete constructions play an important role in theoretical computer science. However, in cryptography complete constructions have so far been either absent or purely theoretical. In 2003, L.A. Levin presented the idea of a combinatorial complete one-way function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post correspon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2016
ISSN: 0097-5397,1095-7111
DOI: 10.1137/140975048